Efficient Online Mechanisms for Persistent, Periodically Inaccessible Self-Interested Agents
نویسندگان
چکیده
We consider the problem of implementing a system-optimal decision policy in the context of self-interested agents with private state in an uncertain world. Unique to our model is that we allow both persistent agents, with an agent having a local MDP model to describe how its local world evolves given actions by a center, and also periodically-inaccessible agents, with an agent unable to report information while inaccessible. We first review the dynamic-VCG mechanism of Bergemann and Välimäki (2006), which handles persistent agents. We offer an independent, simple proof of its correctness. We propose a generalized mechanism to allow also for inaccessibility, and identify conditions for its correctness. In closing, we observe that the mechanism is equivalent to the earlier online-VCG mechanism of Parkes and Singh (2003) in a restricted setting.
منابع مشابه
Efficient Mechanisms with Dynamic Populations and Dynamic Types
We consider the truthful implementation of an efficient decision policy when agents have dynamic type and are periodically-inaccessible, with agents unable to report information or make payments while inaccessible. This concept of inaccessibility includes a model of arrival-departure dynamics as a special case. We generalize the dynamic VCG mechanism [Bergemann and Välimäki, 2008] to this envir...
متن کاملPartially Synchronized DEC-MDPs in Dynamic Mechanism Design
In this paper, we combine for the first time the methods of dynamic mechanism design with techniques from decentralized decision making under uncertainty. Consider a multi-agent system with self-interested agents acting in an uncertain environment, each with private actions, states and rewards. There is also a social planner with its own actions, rewards, and states, acting as a coordinator and...
متن کاملA flexible and reasonable mechanism for self-interested agent team forming
As social entities, intelligent agents need to collaborate with others regardless of whether they are cooperative or self interested. Compared with cooperative agents, collaborations among self-interested agents are more complex and dynamic due to the selfish features. Self-interested agents are impelled to cooperate with others by their individual goals. In an agent team composed of self-inter...
متن کاملCan Human-Like Bots Control Collective Mood: Agent-Based Simulations of Online Chats
Using agent-basedmodeling approach, in this paper, we study self-organized dynamics of interacting agents in the presence of chat Bots. Different Bots with tunable “human-like” attributes, which exchange emotional messages with agents, are considered, and collective emotional behavior of agents is quantitatively analysed. In particular, using detrended fractal analysis we determine persistent f...
متن کاملIntention-aware planning under uncertainty for interacting with self-interested, boundedly rational agents
A key challenge in non-cooperative multi-agent systems is that of developing efficient planning algorithms for intelligent agents to perform effectively among boundedly rational, self-interested (i.e., non-cooperative) agents (e.g., humans). To address this challenge, we investigate how intention prediction can be efficiently exploited and made practical in planning, thereby leading to efficien...
متن کامل